Independence Complexes and Edge Covering Complexes via Alexander Duality
نویسندگان
چکیده
منابع مشابه
Independence Complexes and Edge Covering Complexes via Alexander Duality
The combinatorial Alexander dual of the independence complex Ind(G) and that of the edge covering complex EC(G) are shown to have isomorphic homology groups for each non-null graph G. This yields isomorphisms of homology groups of Ind(G) and EC(G) with homology dimensions being appropriately shifted and restricted. The results exhibits the complementary nature of homology groups of Ind(G) and E...
متن کاملSubdivision Yields Alexander Duality on Independence Complexes
We study how the homotopy type of the independence complex of a graph changes if we subdivide edges. We show that the independence complex becomes the Alexander dual if we place one new vertex on each edge of a graph. If we place two new vertices on each edge then the independence complex is the wedge of two spheres. Placing three new vertices on an edge yields the suspension of the independenc...
متن کاملComplexes of directed trees and independence complexes
The theory of complexes of directed trees was initiated by Kozlov to answer a question by Stanley, and later on, results from the theory were used by Babson and Kozlov in their proof of the Lovász conjecture. We develop the theory and prove that complexes on directed acyclic graphs are shellable. A related concept is that of independence complexes: construct a simplicial complex on the vertex s...
متن کاملLaplacians of Covering Complexes
The Laplace operator on a simplicial complex encodes information about the adjacencies between simplices. A relationship between simplicial complexes does not always translate to a relationship between their Laplacians. In this paper we look at the case of covering complexes. A covering of a simplicial complex is built from many copies of simplices of the original complex, maintaining the adjac...
متن کاملTetrahedral Curves via Graphs and Alexander Duality
A tetrahedral curve is a (usually nonreduced) curve in P defined by an unmixed, height two ideal generated by monomials. We characterize when these curves are arithmetically Cohen-Macaulay by associating a graph to each curve and, using results from combinatorial commutative algebra and Alexander duality, relating the structure of the complementary graph to the Cohen-Macaulay property.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/526